A note on ranking assignments using reoptimization
نویسندگان
چکیده
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Computational results for the new algorithm are presented.
منابع مشابه
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Its computational performance is compared with all available implementations of algorithms ...
متن کاملErratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]
In the paper Pedersen, Nielsen, and Andersen [5] we developed an algorithm for ranking n×n assignments using reoptimization and compare our algorithm with other algorithms with the same time complexity. However, as pointed out by Dr. A. Volgenant, we unfortunately missed one available implementation written by Miller, Stone, and Cox [3] in IEEE Transactions on Aerospace and Electronic Systems. ...
متن کاملA note on a new variant of Murty's ranking assignments algorithm
In this paper a variant of Murty’s algorithm for ranking assignments according to cost is presented. It is shown that the worst-case computational complexity is better in this variant than in the original form of the algorithm. Computational results comparing three methods for ranking assignments are reported. They show that the behaviour of the new variant is also better in practice.
متن کاملA note on the traveling salesman reoptimization problem under vertex insertion
We propose a 4 3 -approximation in linear time for the metric traveling salesman reoptimization problem under vertex insertion. This constitutes an improvement of the time complexity of the best known existing bound since in (G. Ausiello, B. Escoffier, J. Monnot and V. Th. Paschos: Reoptimization of minimum and maximum traveling salesman’s tours. J. Discrete Algorithms 7(4): 453-463, 2009) a 4/...
متن کاملPaired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands
In this paper, we develop a paired cooperative reoptimization (PCR) strategy to solve the vehicle routing problem with stochastic demands (VRPSD). The strategy can realize reoptimization policy under cooperation between a pair of vehicles, and it can be applied in the multivehicle situation. The PCR repeatedly triggers communication and partitioning to update the vehicle assignments given real-...
متن کامل